A Solution Proposal for the Capacitated P-Median Problem with Tabu Search
نویسندگان
چکیده
منابع مشابه
A Solution Proposal for the Capacitated P-Median Problem with Tabu Search
This work presents the Capacitated P-Median problem, which seeks to solve the optimal location of p distributors. In understanding the computational complexity of this problem, partitioning principles are applied in the process of associating a distribution center with customers to be serviced. These are treated as clusters containing each distribution center and its customers. The optimization...
متن کاملClustering Search Heuristic for the Capacitated p -Median Problem
In this paper we present a hybrid heuristic for the capacitated pmedian problem (CPMP). This problem considers a set of n points, each of them with a known demand, the objective consists of finding p medians and assign each point to exactly one median such that the total distance of assigned points to their corresponding medians is minimized, and the a capacity limit on the medians may not be e...
متن کاملThe P-Median Problem: A Tabu Search Approximation Proposal Applied to Districts
P-median is one of the most important Location-Allocation problems. This problem determines the location of facilities and assigns demand points to them. The p-median problem can be established as a discrete problem in graph terms as: Let G = (V, E) be an undirected graph where V is the set of n vertices and E is the set of edges with an associated weight that can be the distance between the ve...
متن کاملAn Efficient Hybrid Metaheuristic for Capacitated p-Median Problem
Capacitated p-median problem (CPMP) is a well-known facility-location problem, in which p capacitated facility points are selected to satisfy n demand points in such a way that the total assigned demand to each facility does not exceed its capacity. Minimizing the total sum of distances between each demand point and its nearest facility point is the objective of the problem. Developing an effic...
متن کاملMatheuristics for the capacitated p-median problem
The recent evolution of computers and mathematical programming techniques has provide the development of a new class of algorithms called matheuristics. Associated with an improvement of MIP solvers, many of these methods have been successful applied to solve combinatorial problems. This work presents an approach that hybridizes metaheuristics based on local search and exact algorithms to solve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Research in Computing Science
سال: 2016
ISSN: 1870-4069
DOI: 10.13053/rcs-121-1-5